#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

// 存储图
const int N = 1e5 + 10;
int h[N], e[N], ne[N], idx;
int n, m;
// q[N]是队列，d[N]为每个点的入度
int q[N], d[N], flag[N];

int add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

// 成环无法进行拓扑
bool topsort()
{
    int hh = 0, tt = -1;
    for (int i = 1; i <= n; ++i)
    {
        if (!d[i])
        {
            q[++tt] = i;
            flag[i] = true;
        }
    }
    while (hh <= tt)
    {
        int now = q[hh++];
        // cout << now << endl;
        for (int i = h[now]; ~i; i = ne[i])
        {
            int j = e[i];
            if (!flag[j])
            {
                --d[j];
                if (d[j] == 0)
                {
                    q[++tt] = j;
                    flag[j] = true;
                }
            }
        }
    }
    return tt == n - 1;
}

int main()
{
    cin >> n >> m;
    memset(h, -1, sizeof h);
    for (int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        add(a, b);
        ++d[b];
    }
    if (topsort())
    {
        for (int i = 0; i < n; ++i)
            cout << q[i] << ' ';
        cout << endl;
    }
    else
        cout << -1 << ' ';
    return 0;
}
